Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
نویسندگان
چکیده
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive semidefinite rank, and their symmetric analogues: the completely positive rank and the completely positive semidefinite rank. We study the convergence properties of our hierarchies, compare them extensively to known lower bounds, and provide some (numerical) examples.
منابع مشابه
New Bases for Polynomial-Based Spaces
Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...
متن کاملBounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
In this paper we study bipartite quantum correlations using techniques from tracial polynomial optimization. We construct a hierarchy of semidefinite programming lower bounds on the minimal entanglement dimension of a bipartite correlation. This hierarchy converges to a new parameter: the minimal average entanglement dimension, which measures the amount of entanglement needed to reproduce a qua...
متن کاملOn the Complexity of Noncommutative Polynomial Factorization
In this paper we study the complexity of factorization of polynomials in the free noncommutative ring F〈x1, x2, . . . , xn〉 of polynomials over the field F and noncommuting variables x1, x2, . . . , xn. Our main results are the following: • Although F〈x1, . . . , xn〉 is not a unique factorization ring, we note that variabledisjoint factorization in F〈x1, . . . , xn〉 has the uniqueness property....
متن کاملLimitations of convex programming: lower bounds on extended formulations and factorization ranks (Dagstuhl Seminar 15082)
This report documents the program and the outcomes of Dagstuhl Seminar 15082 “Limitations of convex programming: lower bounds on extended formulations and factorization ranks” held in February 2015. Summaries of a selection of talks are given in addition to a list of open problems raised during the seminar. Seminar February 15–20, 2015 – http://www.dagstuhl.de/15082 1998 ACM Subject Classificat...
متن کاملRiordan group approaches in matrix factorizations
In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.
متن کامل